The complexity of reasoning with relative directions

© 2014 The Authors and IOS Press. Whether reasoning with relative directions can be performed in NP has been an open problem in qualitative spatial reasoning. Efficient reasoning with relative directions is essential, for example, in rule-compliant agent navigation. In this paper, we prove that reasoning with relative directions is ∃ℝ-complete. As a consequence, reasoning with relative directions is not in NP, unless NP=∃ℝ

Complete gate control of supercurrent in graphene p-n junctions

In a conventional Josephson junction of graphene, the supercurrent is not turned off even at the charge neutrality point, impeding further development of superconducting quantum information devices based on graphene. Here we fabricate bipolar Josephson junctions of graphene, in which a p-n potential barrier is formed in graphene with two closely spaced superconducting contacts, and realize supercurrent ON/OFF states using electrostatic gating only. The bipolar Josephson junctions of graphene also show fully gate-driven macroscopic quantum tunnelling behaviour of Josephson phase particles in a potential well, where the confinement energy is gate tuneable. We suggest that the supercurrent OFF state is mainly caused by a supercurrent dephasing mechanism due to a random pseudomagnetic field generated by ripples in graphene, in sharp contrast to other nanohybrid Josephson junctions. Our study may pave the way for the development of new gate-tuneable superconducting quantum information devices.open114344sciescopu

K-Pop Genres: A Cross-Cultural Exploration

The Proceedings can be viewed at: http://www.ppgia.pucpr.br/ismir2013/wp-content/uploads/2013/10/Proceedings-ISMIR2013-Final.pdfPoster Session 3Current music genre research tends to focus heavily on classical and popular music from Western cultures. Few studies discuss the particular challenges and issues related to non-Western music. The objective of this study is to improve our understanding of how genres are used and perceived in different cultures. In particular, this study attempts to fill gaps in our understanding by examining K-pop music genres used in Korea and comparing them with genres used in North America. We provide background information on K-pop genres by analyzing 602 genre-related labels collected from eight major music distribution websites in Korea. In addition, we report upon a user study in which American and Korean users annotated genre information for 1894 K-pop songs in order to understand how their perceptions might differ or agree. The results show higher consistency among Korean users than American users demonstrated by the difference in Fleiss’ Kappa values and proportion of agreed genre labels. Asymmetric disagreements between Americans and Koreans on specific genres reveal some interesting differences in the perception of genres. Our findings provide some insights into challenges developers may face in creating global music services.published_or_final_versio

Deriving Grover's lower bound from simple physical principles

Grover's algorithm constitutes the optimal quantum solution to the search problem and provides a quadratic speed-up over all possible classical search algorithms. Quantum interference between computational paths has been posited as a key resource behind this computational speed-up. However there is a limit to this interference, at most pairs of paths can ever interact in a fundamental way. Could more interference imply more computational power? Sorkin has defined a hierarchy of possible interference behaviours—currently under experimental investigation—where classical theory is at the first level of the hierarchy and quantum theory belongs to the second. Informally, the order in the hierarchy corresponds to the number of paths that have an irreducible interaction in a multi-slit experiment. In this work, we consider how Grover's speed-up depends on the order of interference in a theory. Surprisingly, we show that the quadratic lower bound holds regardless of the order of interference. Thus, at least from the point of view of the search problem, post-quantum interference does not imply a computational speed-up over quantum theory

Generalised phase kick-back: the structure of computational algorithms from physical principles

The advent of quantum computing has challenged classical conceptions of which problems are efficiently solvable in our physical world. This motivates the general study of how physical principles bound computational power. In this paper we show that some of the essential machinery of quantum computation—namely reversible controlled transformations and the phase kick-back mechanism—exist in any operational-defined theory with a consistent notion of information. These results provide the tools for an exploration of the physics underpinning the structure of computational algorithms. We investigate the relationship between interference behaviour and computational power, demonstrating that non-trivial interference behaviour is a general resource for post-classical computation. In proving the above, we connect higher-order interference to the existence of post-quantum particle types, potentially providing a novel experimental test for higher-order interference. Finally, we conjecture that theories with post-quantum interference—the higher-order interference of Sorkin—can solve problems intractable even on a quantum computer

Higher-Order Interference in Extensions of Quantum Theory

Quantum interference, manifest in the two slit experiment, lies at the heart of several quantum computational speed-ups and provides a striking example of a quantum phenomenon with no classical counterpart. An intriguing feature of quantum interference arises in a variant of the standard two slit experiment, in which there are three, rather than two, slits. The interference pattern in this set-up can be written in terms of the two and one slit patterns obtained by blocking one, or more, of the slits. This is in stark contrast with the standard two slit experiment, where the interference pattern cannot be written as a sum of the one slit patterns. This was first noted by Rafael Sorkin, who raised the question of why quantum theory only exhibits irreducible interference in the two slit experiment. One approach to this problem is to compare the predictions of quantum theory to those of operationally-defined ‘foil’ theories, in the hope of determining whether theories that do exhibit higher-order interference suffer from pathological—or at least undesirable—features. In this paper two proposed extensions of quantum theory are considered: the theory of Density Cubes proposed by Dakić, Paterek and Brukner, which has been shown to exhibit irreducible interference in the three slit set-up, and the Quartic Quantum Theory of Życzkowski. The theory of Density Cubes will be shown to provide an advantage over quantum theory in a certain computational task and to posses a well-defined mechanism which leads to the emergence of quantum theory—analogous to the emergence of classical physics from quantum theory via decoherence. Despite this, the axioms used to define Density Cubes will be shown to be insufficient to uniquely characterise the theory. In comparison, Quartic Quantum Theory is a well-defined theory and we demonstrate that it exhibits irreducible interference to all orders. This feature of Życzkowski’s theory is argued not to be a genuine phenomenon, but to arise from an ambiguity in the current definition of higher-order interference in operationally-defined theories. Thus, to begin to understand why quantum theory is limited to a certain kind of interference, a new definition of higher-order interference is needed that is applicable to, and makes good operational sense in, arbitrary operationally-defined theories

Two approaches to Sidorenko's conjecture

Sidorenko’s conjecture states that for every bipartite graph H on {1, · · · , k} Z Y (i,j)∈E(H) h(xi , yj )dµ|V (H)| ≥ �Z h(x, y) dµ2 �|E(H)| holds, where µ is the Lebesgue measure on [0, 1] and h is a bounded, nonnegative, symmetric, measurable function on [0, 1]2 . An equivalent discrete form of the conjecture is that the number of homomorphisms from a bipartite graph H to a graph G is asymptotically at least the expected number of homomorphisms from H to the Erd˝os-R´enyi random graph with the same expected edge density as G. In this paper, we present two approaches to the conjecture. First, we introduce the notion of tree-arrangeability, where a bipartite graph H with bipartition A∪B is tree-arrangeable if neighborhoods of vertices in A have a certain tree-like structure. We show that Sidorenko’s conjecture holds for all tree-arrangeable bipartite graphs. In particular, this implies that Sidorenko’s conjecture holds if there are two vertices a1, a2 in A such that each vertex a ∈ A satisfies N(a) ⊆ N(a1) or N(a) ⊆ N(a2), and also implies a recent result of Conlon, Fox, and Sudakov [3]. Second, if T is a tree and H is a bipartite graph satisfying Sidorenko’s conjecture, then it is shown that the Cartesian product T H of T and H also satisfies Sidorenko’s conjecture. This result implies that, for all d ≥ 2, the d-dimensional grid with arbitrary side lengths satisfies Sidorenko’s conjecture

Effect of additives on the viscosity of liquid-phase dimethylaluminum hydride

The effect of additives on the viscosity of liquid-phase dimethylaluminum hydride (DMAH) was investigated. The viscosity of pure liquid DMAH was measured to be 6400 centipoise (cP) and due to its high viscosity, it is difficult to vaporize DMAH effectively in a bubbler in the chemical vapor deposition of aluminum. N,N-Dimethyl-1-naphthylamine and N-ethyl-N-methylaniline were selected as an additive because they are a liquid at room temperature and have a high boiling point. The viscosity of DMAH was drastically reduced down to 6 cP with the addition of 3.2 mol % of N-ethyl-N-methylaniline and 8 cP with the addition of 4.3 mol % of N,N-dimethyl-1-naphthylamine.ope

Connecting qualitative spatial and temporal representations by propositional closure

This paper establishes new relationships between existing qualitative spatial and temporal representations. Qualitative spatial and temporal representation (QSTR) is concerned with abstractions of infinite spatial and temporal domains, which represent configurations of objects using a finite vocabulary of relations, also called a qualitative calculus. Classically, reasoning in QSTR is based on constraints. An important task is to identify decision procedures that are able to handle constraints from a single calculus or from several calculi. In particular the latter aspect is a longstanding challenge due to the multitude of calculi proposed. In this paper we consider propositional closures of qualitative constraints which enable progress with respect to the longstanding challenge. Propositional closure allows one to establish several translations between distinct calculi. This enables joint reasoning and provides new insights into computational complexity of individual calculi. We conclude that the study of propositional languages instead of previously considered purely relational languages is a viable research direction for QSTR leading to expressive formalisms and practical algorithms

Journey of water in pine cones

Pine cones fold their scales when it rains to prevent seeds from short-distance dispersal. Given that the scales of pine cones consist of nothing but dead cells, this folding motion is evidently related to structural changes. In this study, the structural characteristics of pine cones are studied on micro-/macro-scale using various imaging instruments. Raindrops fall along the outer scales to the three layers (bract scales, fibers and innermost lignified structure) of inner pine cones. However, not all the layers but only the bract scales get wet and then, most raindrops move to the inner scales. These systems reduce the amount of water used and minimize the time spent on structural changes. The result shows that the pine cones have structural advantages that could influence the efficient motion of pine cones. This study provides new insights to understand the motion of pine cones and would be used to design a novel water transport system.119Ysciescopu